#include <iostream>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
if (n%2==0) {cout << "Marsel"; return 0;}
for (int i=1; i*i<=m; i++) {
if (m%i==0) {
if (i>=k && i!=m) {cout << "Timur"; return 0;}
if ((m/i)>=k && (m/i)!=m) {cout << "Timur"; return 0;}
}
}
cout << "Marsel";
return 0;
}/*1689718675.8371506*/
1358D - The Best Vacation | 1620B - Triangles on a Rectangle |
999C - Alphabetic Removals | 1634C - OKEA |
1368C - Even Picture | 1505F - Math |
1473A - Replacing Elements | 959A - Mahmoud and Ehab and the even-odd game |
78B - Easter Eggs | 1455B - Jumps |
1225C - p-binary | 1525D - Armchairs |
1257A - Two Rival Students | 1415A - Prison Break |
1271A - Suits | 259B - Little Elephant and Magic Square |
1389A - LCM Problem | 778A - String Game |
1382A - Common Subsequence | 1512D - Corrupted Array |
667B - Coat of Anticubism | 284B - Cows and Poker Game |
1666D - Deletive Editing | 1433D - Districts Connection |
2B - The least round way | 1324A - Yet Another Tetris Problem |
246B - Increase and Decrease | 22E - Scheme |
1566A - Median Maximization | 1278A - Shuffle Hashing |